Optimisation of identical parallel machine scheduling problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight bounds for the identical parallel machine scheduling problem

We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the so-called lifting procedure. In addition, two optimization-based heuristics are proposed. These heuristics require iteratively solving a subset-sum problem. We present the results of compu...

متن کامل

Parallel Machine Scheduling Problem

A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...

متن کامل

minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem

this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

متن کامل

Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems

We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Rapid Manufacturing

سال: 2019

ISSN: 1757-8817,1757-8825

DOI: 10.1504/ijrapidm.2019.10017670